Posetted Trees and Baker-Campbell-Hausdorff Product
نویسندگان
چکیده
منابع مشابه
Computing the Baker-Campbell-Hausdorff series and the Zassenhaus product
The Baker-Campbell-Hausdorff (BCH) series and the Zassenhaus product are of fundamental importance for the theory of Lie groups and their applications in physics. In this paper, various methods for the computation of the terms in these expansions are compared, and a new efficient approach for the calculation of the Zassenhaus terms is introduced. Mathematica implementations for the most efficie...
متن کاملExponential Baker-campbell-hausdorff Formula and Compressed Kashiwara-vergne Conjecture
Abstract. The classical Baker-Campbell-Hausdorff formula gives a recursive way to compute the Hausdorff series H = log(ee ) for non-commuting X, Y . Formally H lives in a completion L̂ of the free Lie algebra L generated by X, Y . We prove that there are F, G ∈ [L̂, L̂] such that H = e Xe + eY e. We describe explicitly all symmetric solutions to the Kashiwara-Vergne conjecture in Lie algebras L, w...
متن کاملBirkhoff Type Decompositions and the Baker–campbell–hausdorff Recursion
We describe a unification of several apparently unrelated factorizations arisen from quantum field theory, vertex operator algebras, combinatorics and numerical methods in differential equations. The unification is given by a Birkhoff type decomposition that was obtained from the Baker–Campbell–Hausdorff formula in our study of the Hopf algebra approach of Connes and Kreimer to renormalization ...
متن کاملBaker-Campbell-Hausdorff relation for special unitary groups SU(N)
Multiplication of two elements of the special unitary group SU(N) determines uniquely a third group element. A Baker-Campbell-Hausdorff relation is derived which expresses the group parameters of the product (written as an exponential) in terms of the parameters of the exponential factors. This requires the eigenvalues of three (N ×N) matrices. Consequently, the relation can be stated analytica...
متن کاملAn algorithm for the Baker-Campbell-Hausdorff formula
A simple algorithm, which exploits the associativity of the BCH formula, and that can be generalized by iteration, extends the remarkable simplification of the BakerCampbell-Hausdorff (BCH) formula, recently derived by Van-Brunt and Visser. We show that if [X,Y ] = uX + vY + cI, [Y, Z] = wY + zZ + dI, and, consistently with the Jacobi identity, [X,Z] = mX + nY + pZ + eI, then exp(X) exp(Y ) exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mediterranean Journal of Mathematics
سال: 2012
ISSN: 1660-5446,1660-5454
DOI: 10.1007/s00009-012-0235-z